Factorisation of Macdonald polynomials
نویسندگان
چکیده
1. Macdonald polynomials Macdonald polynomials P λ (x; q, t) are orthogonal symmetric polynomials which are the natural multivariable generalisation of the continuous q-ultraspherical polyno-mials C n (x; β|q) [2] which, in their turn, constitute an important class of hyper-geometric orthogonal polynomials in one variable. Polynomials C n (x; β|q) can be obtained from the general Askey-Wilson polynomials [3] through a specification of their four parameters (see, for instance, [9]), so that C n (x; β|q) depend only on one parameter β, apart from the degree n and the basic parameter q. In an analogous way, the Macdonald polynomials P λ (x; q, t) with one parameter t could be obtained as a limiting case of the 5-parameter Koornwinder's multivariable generalisation of the Askey-Wilson polynomials [10]. The main reference for the Macdonald polynomials is the book [17], Ch. VI, where they are called symmetric functions with two parameters. Let K = Q(q, t) be the field of rational functions in two indeterminants q, t; K[x] = K[x 1 ,. .. , x n ] be the ring of polynomials in n variables x = (x 1 ,. .. , x n) with coefficients in K; and K[x] W be the subring of all symmetric polynomials. The Macdonald polynomials P λ (x) = P λ (x; q, t) are symmetric polynomials labelled by the sequences λ = {0 ≤ λ 1 ≤ λ 2 ≤. .. ≤ λ n } of integers (dominant weights). They form a K basis of K[x] W and are uniquely characterised as joint eigenvectors of the commuting q-difference
منابع مشابه
Macdonald polynomials at roots of unity
The aim of this note is to give some factorisation formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those given in [LLT1] for Hall-Littlewood functions. Résumé. Le but de cette note est de donner quelques formules de factorisations pour différentes versions des polynômes de Macdonald lorsque le paramètre t est spéci...
متن کاملFactorization formulas for MacDonald polynomials
In [LLT1], Lascoux, Leclerc and Thibon give some factorisation formulas for Hall-Littlewood functions when the parameter q is specialized at roots of unity. They also give formulas in terms of cyclic characters of the symmetric group. In this article, we give a generalization of these specializations for different versions of the Macdonald polynomials and we obtain similar formulas in terms of ...
متن کاملFactorisation in the Ring of Exponential Polynomials
We study factorisation in the ring of exponential polynomials and provide a proof of Ritt's factorisation theorem in modern notation and so generalised as to deal with polynomial coeecients as well as with several variables. We do this in the more general context of a group ring of a divisible torsion-free ordered abelian group over a unique factorisation domain. We study factorisation in the g...
متن کاملA note on factorisation of division polynomials
In [2], Verdure gives the factorisation patterns of division polynomials of elliptic curves defined over a finite field. However, the result given there contains a mistake. In this paper, we correct it.
متن کاملGCD and Factorisation of multivariate polynomials
Some widely known techniques can be used to factorise univariate polynomials over the domain of integers. However, finding algorithms which factorise univariate and multivariate polynomials over Z and other domains is a little trickier. Several factorisation algorithms first need GCDs of the polynomials. Computing GCDs of polynomials is also necessary for adding rational functions. Both problem...
متن کامل